Signatura of Magic and Latin Integer Squares: Isentropic Clans and Indexing

نویسندگان

  • Ian Cameron
  • Adam Rogers
  • Peter D. Loly
چکیده

The 2010 study of the Shannon entropy of order nine Sudoku and Latin square matrices by Newton and DeSalvo [Proc. Roy. Soc. A 2010] is extended to natural magic and Latin squares up to order nine. We demonstrate that decimal and integer measures of the Singular Value sets, here named SV clans, are a powerful way of comparing different integer squares. Several complete sets of magic and Latin squares are included, including the order eight Franklin subset which is of direct relevance to magic square line patterns on chess boards. While early examples suggested that lower rank specimens had lower entropy, sufficient data is presented to show that some full rank cases with low entropy possess a set of singular values separating into a dominant group with the remainder much weaker. An effective rank measure helps understand these issues. We also introduce a new measure for integer squares based on the sum of the fourth powers of the singular values which appears to give a useful method of indexing both Latin and magic squares. This can be used to begin cataloging a ”library” of magical squares. Based on a video presentation in celebration of George Styan’s 75th at LINSTAT2012 and IWMS-21 on 19 July, 2012 at Be֒dlewo, Poland.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

INTEGER-MAGIC SPECTRA OF CYCLE RELATED GRAPHS

For any h in N , a graph G = (V, E) is said to be h-magic if there exists a labeling l: E(G) to Z_{h}-{0} such that the induced vertex set labeling l^{+: V(G) to Z_{h}} defined by l^{+}(v)= Summation of l(uv)such that e=uvin in E(G) is a constant map. For a given graph G, the set of all for which G is h-magic is called the integer-magic spectrum of G and is denoted by IM(G). In this paper, the ...

متن کامل

Numerical Enumeration of Greco-Latin Prime Order Associative Magic Squares

A magic square of order n consists of the numbers 1 to n placed such that the sum of each row, column and principal diagonal equals the magic sum n(n +1)/2. In addition, an odd ordered magic square is associative or self-complementary if diagonally opposite elements have the same sum (n +1)/2. The magic square is said to be regular Greco-Latin if it can be decomposed as a sum of a pair of Latin...

متن کامل

Inside-Out Polytopes

We present a common generalization of counting lattice points in rational polytopes and the enumeration of proper graph colorings, nowhere-zero flows on graphs, magic squares and graphs, antimagic squares and graphs, compositions of an integer whose parts are partially distinct, and generalized latin squares. Our method is to generalize Ehrhart’s theory of lattice-point counting to a convex pol...

متن کامل

Lecture 5 : Latin Squares and Magic

Today's application is to magic! Not the friendship kind, though 1 ; instead, we're going to talk about magic squares, an incredibly old piece of mathematics that we can study using Latin squares. Definition. A magic square is a n × n grid filled with the integers {0, 1,. .. n 2 − 1}, such that • each number is used exactly once in our entire grid, and • the sum of all of the entries along any ...

متن کامل

Strongly symmetric self-orthogonal diagonal Latin squares and Yang Hui type magic squares

Keywords: Self-orthogonal Latin square Strongly symmetric Magic square Yang Hui type a b s t r a c t In this paper, a strongly symmetric self-orthogonal diagonal Latin square of order n with a special property (* SSSODLS(n)) is introduced. It is proved that a * SSSODLS(n) exists if and only if n ≡ 0 (mod 4) and n ̸ = 4. As an application, it is shown that there exists a Yang Hui type magic squar...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2014